Graph coloring

Results: 948



#Item
21Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1  ∗

Interval Scheduling to Maximize Bandwidth Provision Mordechai Shalom 1 ∗

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2013-09-22 04:19:43
22Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

Add to Reading List

Source URL: www.cs.huji.ac.il

Language: English - Date: 2014-11-26 08:32:33
23Spectral Graph Theory  Lecture 3 The Adjacency Matrix and The nth Eigenvalue Daniel A. Spielman

Spectral Graph Theory Lecture 3 The Adjacency Matrix and The nth Eigenvalue Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-08-17 14:43:26
24Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell  Computer Engineering and Networks Laboratory

Virtual Coordinates for Ad hoc and Sensor Networks∗ Thomas Moscibroda Regina O’Dell Computer Engineering and Networks Laboratory

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:28
25Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Upper and Lower Bounds for Finding Connected Motifs in Vertex-Colored Graphs ⋆ Michael R. Fellows a,1 Guillaume Fertin b Danny Hermelin c,2 and St´ephane Vialette d a Office

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:26:37
26BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

Add to Reading List

Source URL: ssdbm2011.ssdbm.org

Language: English - Date: 2011-09-01 19:29:56
27Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases  David Rolnick

Graph-coloring ideals Nullstellensatz certificates, Gröbner bases for chordal graphs, and hardness of Gröbner bases David Rolnick

Add to Reading List

Source URL: www.issac-symposium.org

Language: English - Date: 2015-08-17 07:00:17
28CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   STRUCTURE AND COMPLEXITY

CHARLES UNIVERSITY FACULTY OF MATHEMATICS AND PHYSICS   STRUCTURE AND COMPLEXITY

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2007-10-31 07:12:22
29Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Finding Common Structured Patterns in Linear Graphs ? Guillaume Fertin LINA, CNRS UMR 6241, Universit´e de Nantes, 2 rue de la Houssini`ere, 44322 Nantes, France

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2011-04-27 05:27:10
30Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Although the result is correct, the algorithm and analysis presented in this paper contain non-trivial errors. These have been fixed in a technical report (availabe at http://www.disco.ethz.ch/publications/planarmds_-1.p

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:22